Every numerical semigroup is one half of a symmetric numerical semigroup

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Addition Behavior of a Numerical Semigroup 23

— In this work we study some objects describing the addition behavior of a numerical semigroup and we prove that they uniquely determine the numerical semigroup. We then study the case of Arf numerical semigroups and find some specific results. Résumé (Comportement de l’addition dans un semi-groupe numérique). — Dans ce travail, nous étudions des objets qui décrivent le comportement de l’additi...

متن کامل

Every finite semigroup is embeddable in a finite relatively free semigroup

The title result is proved by a Murskii-type embedding. Results on some related questions are also obtained. For instance, it is shown that every finitely generated semigroup satisfying an identity ξ d = ξ2d is embeddable in a relatively free semigroup satisfying such an identity, generally with a larger d ; but that an uncountable semigroup may satisfy such an identity without being embeddable...

متن کامل

Fiat categorification of the symmetric inverse semigroup and the semigroup

Starting from the symmetric group Sn , we construct two fiat 2-categories. One of them can be viewed as the fiat “extension” of the natural 2-category associated with the symmetric inverse semigroup (considered as an ordered semigroup with respect to the natural order). This 2-category provides a fiat categorification for the integral semigroup algebra of the symmetric inverse semigroup. The ot...

متن کامل

The Numerical Semigroup of Phrases' Lengths in a Simple Alphabet

Let A be an alphabet with two elements. Considering a particular class of words (the phrases) over such an alphabet, we connect with the theory of numerical semigroups. We study the properties of the family of numerical semigroups which arise from this starting point.

متن کامل

The Complexity of the Numerical Semigroup Gap Counting Problem

In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined as a positive integer that does not belong to the numerical semigroup. The computation of gaps of numerical semigroups has been actively studied from the 19t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2007

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-07-09098-3